Memory Size Estimation of Supercomputing Nodes of Computational Grid using Queuing Theory
ثبت نشده
چکیده
Grid computing principles focus on large-scale resource sharing in distributed systems in a flexible, secure and coordinated fashion. The most widespread contemplation is performance, because computational grid servers must offer cost-effective and high-availability services in the elongated period, thus they have to be scaled to meet the expected load. Performance measurements can be the base for performance modeling and prediction. With the help of performance models, the performance metrics (like buffer estimation, waiting time) can be determined at the development process. This paper describes the possible queue models those can be applied in the estimation of queue length to estimate the final value of the memory size. Both simulation and experimental studies using synthesized workloads and analysis of real-world Gateway Servers demonstrate the effectiveness of the proposed system. General Terms Grid Computing, Computational Grid, Distributed Computing, Cloud Computing.
منابع مشابه
Scheduling and Stochastic Capacity Estimation of an EV Charging Station with PV Rooftop Using Queuing Theory and Random Forest
Power capacity of EV charging stations could be increased by installing PV arrays on their rooftops. In these charging stations, power transmission can be two-sided when needed. In this paper a new method based on queuing theory and random forest algorithm proposed to calculate net power of charging station considering random SOC of EV’s. Due to estimation time constraints, a queuing model with...
متن کاملStability Assessment Metamorphic Approach (SAMA) for Effective Scheduling based on Fault Tolerance in Computational Grid
Grid Computing allows coordinated and controlled resource sharing and problem solving in multi-institutional, dynamic virtual organizations. Moreover, fault tolerance and task scheduling is an important issue for large scale computational grid because of its unreliable nature of grid resources. Commonly exploited techniques to realize fault tolerance is periodic Checkpointing that periodically ...
متن کاملRemarks Regarding Queuing Model and Packet Loss Probability for the Traffic with Self-Similar Characteristics
Network management techniques have long been of interest to the networking research community. The queue size plays a critical role for the network performance. The adequate size of the queue maintains Quality of Service (QoS) requirements within limited network capacity for as many users as possible. The appropriate estimation of the queuing model parameters is crucial for both initial size es...
متن کاملMulti-granularity Parallel Computing in a Genome-Scale Molecular Evolution Application
Previously [1], we reported a coarse-grained parallel computational approach to identifying rare molecular evolutionary events often referred to as horizontal gene transfers. Very high degrees of parallelism (up to 65x speedup on 4,096 processors) were reported, yet the overall execution time for a realistic problem size was still on the order of 12 days. With the availability of large numbers ...
متن کاملFitting the Three-parameter Weibull Distribution by using Greedy Randomized Adaptive Search Procedure
The Weibull distribution is widely employed in several areas of engineering because it is an extremely flexible distribution with different shapes. Moreover, it can include characteristics of several other distributions. However, successful usage of Weibull distribution depends on estimation accuracy for three parameters of scale, shape and location. This issue shifts the attentions to the requ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010